Resultaten visas 1 - 10 / 4419
resultat / per sida
Vilka publikationsuppgifter finns i tjänsten?
Publikationens namn
Upphovspersoner
Publikationskanal
År
Publicationer information ikon

Amortized Complexity of Bulk Updates in ALV-Trees

Referentgranskad
Soisalon-Soininen, E.; Widmayer, P.
-2002Publicationer information ikon

I/O-OPTIMAL BULK INSERTION

Soisalon-Soininen, Eljas; Pollari-Malmi, Kerttu
-2003Publicationer information ikon

Single and Bulk Updates in Stratifield Trees: An Amortized and Worst-Case Analysis

Referentgranskad
Soisalon-Soininen, Eljas; Widmayer, Peter
SPRINGER2003Publicationer information ikon

Relaxed AVL trees, main-memory databases, and concurrency.

Referentgranskad
Soisalon-Soininen, E.; Nurmi, O.; Wood, D.
International Journal of Computer Mathematics1996Publicationer information ikon

Bulk-Insertion Sort: Towards Composite Measures of Presortedness

Referentgranskad
Saikkonen, Riku; Soisalon-Soininen, Eljas
SPRINGER2009Publicationer information ikon

Distributed Highly Available Search Trees

Referentgranskad
Schlude, K.; Soisalon-Soininen, E.; Widmayer, P.
-2002Publicationer information ikon

Relaxed Balancing in Search Trees

Referentgranskad
Soisalon-Soininen, E.; Widmayer, P.
Kluwer Academic Publishers1997Publicationer information ikon

Concurrency Control and I/O-Optimality in Bulk Insertion

Referentgranskad
Pollari-Malmi, Kerttu; Soisalon-Soininen, E.
SPRINGER2004Publicationer information ikon

Relaxed balance for search trees with local rebalancing

Referentgranskad
Larsen, Kim S.; Ottmann, Thomas; Soisalon-Soininen, Eljas
Acta Informatica2001Publicationer information ikon

Chromatic binary search trees: A structure for concurrent rebalancing.

Referentgranskad
Soisalon-Soininen, E.; Nurmi, O.
Acta Informatica1996

Amortized Complexity of Bulk Updates in ALV-Trees

Referentgranskad
2002

I/O-OPTIMAL BULK INSERTION

2003

Single and Bulk Updates in Stratifield Trees: An Amortized and Worst-Case Analysis

Referentgranskad
2003

Relaxed AVL trees, main-memory databases, and concurrency.

Referentgranskad
1996

Bulk-Insertion Sort: Towards Composite Measures of Presortedness

Referentgranskad
2009

Distributed Highly Available Search Trees

Referentgranskad
2002

Relaxed Balancing in Search Trees

Referentgranskad
1997

Concurrency Control and I/O-Optimality in Bulk Insertion

Referentgranskad
2004

Relaxed balance for search trees with local rebalancing

Referentgranskad
2001

Chromatic binary search trees: A structure for concurrent rebalancing.

Referentgranskad
1996